The Fundamental Group of a Locally Finite Graph with Ends- a Hyperfinite Approach
نویسندگان
چکیده
The end compactification |Γ| of the locally finite graph Γ is the union of the graph and its ends, endowed with a suitable topology. We show that π1(|Γ|) embeds into a nonstandard free group with hyperfinitely many generators, i.e. an ultraproduct of finitely generated free groups, and that the embedding we construct factors through an embedding into an inverse limit of free groups. We also show how to recover the standard description of π1(|Γ|) given in [DS11a]. Finally, we give some applications of our result, including a short proof that certain loops in |Γ| are non-nullhomologous.
منابع مشابه
On trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملThe fundamental group of a locally finite graph with ends
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the free groups ⇡1(G 0) with G0 ✓ G finite.
متن کاملThe Fundamental Group of Locally Finite Graphs with Ends
We characterize the fundamental group of a locally finite graph G with ends, by embedding it canonically as a subgroup in the inverse limit of the free groups π1(G ′) with G′ ⊆ G finite. As an intermediate step, we characterize π1(|G|) combinatorially as a group of infinite words.
متن کاملMeasurable Perfect Matchings for Acyclic Locally Countable Borel graphs
We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields the existence of Borel matchings for such graphs of degree at least three. As a corollary, it follows that acyclic locally countable Borel graphs of degree a...
متن کاملA Bound on Measurable Chromatic Numbers of Locally Finite Borel Graphs
We show that the Baire measurable chromatic number of every locally finite Borel graph on a non-empty Polish space is strictly less than twice its ordinary chromatic number, provided this ordinary chromatic number is finite. In the special case that the connectedness equivalence relation is hyperfinite, we obtain the analogous result for the μ-measurable chromatic number.
متن کامل